Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
451	Introduction Extensions of G RAPH M OTIF MIN-SUB and MIN-ADD CGM Conclusion Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-22 14:07:17 NP-complete problems Applied mathematics Graph theory Theoretical computer science Mathematics Graph coloring
452	Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland, College Park {jimmylin,mschatz}@umd.edu Add to Reading List Source URL: www.umiacs.umd.edu Language: English - Date: 2010-08-02 09:34:23 Distributed computing architecture MapReduce Parallel computing NP-complete problems PageRank Eulerian path Graph Topological graph theory Connected component Graph theory Mathematics Theoretical computer science
453	A First Step Towards Resilient Graph Partitioning for Electrical Grids Nana Arizumi, Kazuhiro Minami, Tomoya Tanjo, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {arizumi, kminami, tanjo, hm2 Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:04 NP-complete problems Graph partition Graph Connected component Cluster analysis Graph coloring Planar separator theorem Consensus clustering Graph theory Theoretical computer science Mathematics
454	Introduction Parameterized Algorithms Parameterized Hardness Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-13 19:09:20 NP-complete problems Graph coloring Connectivity Graph Topology Graph theory Theoretical computer science Mathematics
455	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
456	A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2008-01-02 07:43:53 Analytic number theory Meromorphic functions Degree distribution Scale-free network Riemann zeta function Degree Random graphs NP-complete problems Dominating set Graph theory Mathematics Mathematical analysis
457	arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-05-03 12:26:04 Hypergraph NP-complete problems Graph Packing in a hypergraph Orbifold Graph theory Theoretical computer science Mathematics
458	Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-05-21 20:27:46 Linear algebra NP-complete problems Matrix theory Computational complexity theory Graph partition Approximation algorithm Algorithm Graph theory Eigenvalues and eigenvectors Mathematics Algebra Theoretical computer science
459	On Set Intersection Representations of Graphs ∗ S. Jukna †‡ Abstract The intersection dimension of a bipartite graph with respect to a type L is the smallest number t for which it is possible to assign sets Ax ⊆ Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2008-10-14 11:56:16 Bipartite graph Parity Clique Matching Adjacency matrix Intersection graph Complete bipartite graph Graph Bipartite dimension Graph theory Mathematics NP-complete problems
460	On the construction of convergent transfer subgraphs in general labeled directed graphs 38th CGTC 7 March 2007 Add to Reading List Source URL: contrapunctus.net Language: English - Date: 2012-03-13 13:00:13 Automata theory Finite-state machine Vertex Tree Graph NP-complete problems Directed acyclic graph Ancestral graph Graph theory Theoretical computer science Mathematics

UPDATE